https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19330 Thu 06 Aug 2015 10:47:12 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21683 G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph <S is complete. In this paper starting with the concept of equivalence set as seed property, we form an inequality chain of six parameters, which we call the equivalence chain of G. WE present several basic results on these parameters and problems for further investigation.]]> Sat 24 Mar 2018 08:02:55 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26705 e(G) is the minimum cardinality of an equivalence dominating set of G. In this paper we investigate the structure of graphs G satisfying γ_e (G) = ∣V (G)∣ – ∆(G).]]> Sat 24 Mar 2018 07:26:20 AEDT ]]>